Completeness proofs via canonical models on increasingly generalized settings
نویسنده
چکیده
Acknowledgments As it is usual, I might not have enough room or memory to properly thank you every person who made my stay at the ILLC a rewarding experience. This does not mean they were not important. I learned a lot from my thesis supervisors Alessandra Palmigiano and Maria Aloni who have constantly been there for me, both academically and personally, in spite of their heavy workloads. I have no words to express my gratitude towards their innite patience, their innite kindness, wiseness and generosity as well as their human understanding. Grazie mille! I was welcomed at the Netherlands by Floris Roelofsen who was kind enough to take the time to pick me up at the airport. Him and her sister Eva kindly allowed me to stay at their place on the rst days, a gesture I will not forget any time soon. My rst year at Amsterdam was truly unforgetable thanks to all my house mates at Bijltjespad 22B, which I remember with aection and at times with a pronounced nostalgia. I wish to very specially thank Frank Nebel, Karel Van Oudheusden and Davide Sergio whose sense of humor and constant support within the Master of Logic gave me the strength to endure the sometimes hard times in logic academia. I also would like to thank you Maarten Versteegh and Inés Crespo for their truly friendly spirit which at times I was not able to correspond properly. Tanja Kassenaar from ILLC sta deserves a very special mention, as over the years she has always taken care of us, the students, with a big heart and a never ending patience. Similar patience and devotion to help was shown by Niels Molenaar from the Faculty of Science International oce. My sincere gratitude to both of you. I deeply thank you my fathers, Marcelino Pico and Maria de Lourdes de los Cobos for not quiting on me in spite of all the troubles and for making huge sacrices in order to support me. At last, but not least, I very emphatically wish to manifest my deepest gratitude to those who suered most from my mishaps and mistakes, my loving wife Amanda Alejandra Delgado and my son Oliver. Thank you for supporting me and for bearing with all these years of incertitude and of emotional and nancial stress. Contents Introduction 5 Chapter 1. Preliminaries 6 1.1. The constant domains quantied substructural modal logic …
منابع مشابه
Strong Completeness of Coalgebraic Modal Logics
Canonical models are of central importance in modal logic, in particular as they witness strong completeness and hence compactness. While the canonical model construction is well understood for Kripke semantics, non-normal modal logics often present subtle difficulties – up to the point that canonical models may fail to exist, as is the case e.g. in most probabilistic logics. Here, we present a...
متن کاملFirst-order Possibility Models and Finitary Completeness Proofs
This paper builds on Humberstone’s idea of defining models of propositional modal logic where total possible worlds are replaced by partial possibilities. We follow a suggestion of Humberstone by introducing possibility models for quantified modal logic. We show that a simple quantified modal logic is sound and complete for our semantics. Although Holliday showed that for many propositional mod...
متن کاملAn Easy Completeness Proof for the Modal mu-Calculus on Finite Trees
The μ-calculus is an extension of modal logic with a fixpoint operator. In 1983, Dexter Kozen suggested an axiomatization (see, e.g., [4]). It took more than ten years to prove completeness. This proof is due to Igor Wałukiewicz [7] and is quite involved. We propose here a simpler proof in a particular case. More precisely, we prove the completeness of the Kozen axiomatization Kμ extended with ...
متن کاملNamed Models in Coalgebraic Hybrid Logic
Hybrid logic extends modal logic with support for reasoning about individual states, designated by so-called nominals. We study hybrid logic in the broad context of coalgebraic semantics, where Kripke frames are replaced with coalgebras for a given functor, thus covering a wide range of reasoning principles including, e.g., probabilistic, graded, default, or coalitional operators. Specifically,...
متن کاملCompleteness-via-canonicity for coalgebraic logics
This thesis aims to provide a suite of techniques to generate completeness results for coalgebraic logics with axioms of arbitrary rank. We have chosen to investigate the possibility to generalize what is arguably one of the most successful methods to prove completeness results in ‘classical’ modal logic, namely completeness-via-canonicity. This technique is particularly well-suited to a coalge...
متن کامل